Solving Set Covering Problem with Fireworks Explosion
نویسندگان
چکیده
To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection strategy. The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost.
منابع مشابه
Fireworks Explosion Can Solve the Set Covering Problem
The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we will use a metaheuristic called Fireworks Algorithm (FWA) inspired by the fireworks explosion. Through the observation of the way that fireworks...
متن کاملGlobal Solution to the Cauchy Problem on a Universe Fireworks Model
We prove existence and uniqueness of the global solution to the Cauchy problem on a universe fireworks model with finite total mass at the initial state when the ratio of the mass surviving the explosion, the probability of the explosion of fragments and the probability function of the velocity change of a surviving particle satisfy the corresponding physical conditions. Although the nonrelativ...
متن کاملAnalysis and Improvement of Fireworks Algorithm
The Fireworks Algorithm is a recently developed swarm intelligence algorithm to simulate the explosion process of fireworks. Based on the analysis of each operator of Fireworks Algorithm (FWA), this paper improves the FWA and proves that the improved algorithm converges to the global optimal solution with probability 1. The proposed algorithm improves the goal of further boosting performance an...
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملImproving the Grenade Explosion Method in Solving the Dynamic Cell Formation Problem
Cell formation is the first and most important problem in designing cellular manufacturing systems. We have modeled the dynamic cell formation problem with respect to the minimization of the intercellular movement and cellular reconfiguration costs. Due to the nonpolynomiality of the cell formation models, a newly introduced metaheuristic namely the grenade explosion method (GEM) is applied t...
متن کامل